Every sensible extended top-down tree transducer is a multi bottom-up tree transducer
نویسنده
چکیده
A tree transformation is sensible if the size of each output tree is uniformly bounded by a linear function in the size of the corresponding input tree. Every sensible tree transformation computed by an arbitrary weighted extended top-down tree transducer can also be computed by a weighted multi bottom-up tree transducer. This further motivates weighted multi bottom-up tree transducers as suitable translation models for syntax-based machine translation.
منابع مشابه
Compositions of Extended Top-down Tree Transducers
Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular loo...
متن کاملExtended Multi Bottom-Up Tree Transducers Composition and Decomposition
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers, even linear ones, can compute all transformations that are computed by linear extended top-down tree transducers, which are a th...
متن کاملComposition and Decomposition of Extended Multi Bottom-Up Tree Transducers?
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute all transformations that are computed by linear extended top-down tree transducers (which are a theoretical model for...
متن کاملThe Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deterministic) bottom-up tree transducer except that it translates trees into hypergraphs rather than trees, using hypergraph substitution instead of tree substitution. If every output hypergraph of the transducer is a jungle, i.e., a hypergraph that can be unfolded into a tree, then the tree-to-graph...
متن کاملSurvey: Tree Transducers in Machine Translation
In this survey, several model of tree transducers are investigated with respect to properties that are relevant in machine translation. These properties include: suitable expressiveness, symmetry, preservation of regularity, and closure under composition. For three tree transducer models, top-down tree transducers, extended top-down tree transducers, and extended multi bottom-up tree transducer...
متن کامل